Characterization of the Existence of Galled-Tree Networks

نویسندگان

  • Ján Manuch
  • Xiaohong Zhao
  • Ladislav Stacho
  • Arvind Gupta
چکیده

In this paper, we give a complete characterization of the existence of a galled-tree network in the form of simple sufficient and necessary conditions for both root-known and root-unknown cases. As a by-product we obtain a simple algorithm for constructing galled-tree networks. We also introduce a new necessary condition for the existence of a galled-tree network similar to bi-convexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination

A phylogenetic network is a generalization of a phylogenetic tree, allowing structural properties that are not tree-like. In a seminal paper, Wang et al.(1) studied the problem of constructing a phylogenetic network, allowing recombination between sequences, with the constraint that the resulting cycles must be disjoint. We call such a phylogenetic network a "galled-tree". They gave a polynomia...

متن کامل

A metric for galled networks

Galled networks, directed acyclic graphs that model evolutionary histories with reticulation cycles containing only tree nodes, have become very popular due to both their biological significance and the existence of polynomial time algorithms for their reconstruction. In this paper we prove that Nakhleh’s m measure is a metric for this class of phylogenetic networks and hence it can be safely u...

متن کامل

Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination

A phylogenetic network is a generalization of a phylogenetic tree, allowing structural properties that are not tree-like. With the growth of genomic data, much of which does not fit ideal tree models, there is greater need to understand the algorithmics and combinatorics of phylogenetic networks [10, 11]. However, to date, very little has been published on this, with the notable exception of th...

متن کامل

Eecient Reconstruction of Phylogenetic Networks (of Snps) with Constrained Recombination

A phylogenetic network is a generalization of a phylogenetic tree, incorporating more complex molecular phenomena, such as recombination, than is incorporated into a pure phylogenetic tree. Genomic sequences often do not t a pure tree model, and a phylogenetic network is required to explain the evolution of the sequences. Deducing that history is important for the study of molecular evolution, ...

متن کامل

Haplotype Inferring Via Galled-Tree Networks Is NP-Complete

The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on determining the sets of SNP values of individual chromosomes (haplotypes), since such information better captures the genetic causes of diseases. One of the main algorithmic tools for haplotyping is based on the assumpt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of bioinformatics and computational biology

دوره 4 6  شماره 

صفحات  -

تاریخ انتشار 2006